Multi-way set enumeration in weight tensors
نویسندگان
چکیده
منابع مشابه
The Weight in Enumeration
In our setting enumeration amounts to generate all solutions of a problem instance without duplicates. We address the problem of enumerating the models of B-formulæ. A B-formula is a propositional formula whose connectives are taken from a fixed set B of Boolean connectives. Without imposing any specific order to output the solutions, this task is solved. We completely classify the complexity o...
متن کاملMinimal Dominating Set Enumeration
Let G be a graph on n vertices and m edges. An edge is written xy (equivalently yx). A dominating set in G is a set of vertices D such that every vertex of G is either in D or is adjacent to some vertex of D. It is said to be minimal if it does not contain any other dominating set as a proper subset. For every vertex x let N [x] be {x} ∪ {y | xy ∈ E}, and for every S ⊆ V let N [S] := ⋃ x∈S N [x...
متن کاملMulti-view Tensors
The last few years have seen considerable interest in a the analysis and application of multilinear relations between corresponding features in images taken with a perspective camera. Given a point in space seen in two images, the image points satisfy an epipolar constraint expressed by the fundamental matrix. This is a 3× 3 matrix F that satisfies the equation x′ Fx = 0 where x and x′ are any ...
متن کاملConflict-Driven Answer Set Enumeration
We elaborate upon a recently proposed approach to finding an answer set of a logic program based on concepts from constraint processing and satisfiability checking. We extend this approach and propose a new algorithm for enumerating answer sets. The algorithm, which to our knowledge is novel even in the context of satisfiability checking, is implemented in the clasp answer set solver. We contra...
متن کاملSearch through Systematic Set Enumeration
In many problem domains, solutions take the form of unordered sets. We present the Set-Enumerations (SE)tree a vehicle for representing sets and/or enumerating them in a best-first fashion. We demonstrate its usefulness as the basis for a unifying search-based framework for domains where minimal (maximal) elements of a power set are targeted, where minimal (maximal) partial instantiations of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2010
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-010-5210-y